DNA Computing in Microreactors
نویسندگان
چکیده
The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial optimisation problems, such as Maximum Clique or 3-SAT. This work demonstrates by construction how one micro-reactor design can be programmed optically to solve any instance of Maximum Clique up to its given maximum size (N). It reports on an implementation of the concept proposed previously [1]. The advantage of this design is that it is generically programmable. This contrasts with conventional DNA computing where the individual sequence of biochemical operations depends on the specific problem. Presently, in ongoing research, we are solving a graph for the Maximum Clique problem with N = 6 nodes and have completed the design of a microreactor for N = 20. Furthermore, the design of the DNA solution space will be presented, with solutions encoded in customised word-structured
منابع مشابه
PDMS valves in DNA computers
DNA computing is an interdisciplinary field accessing the possibility for the use of biomolecules, such as DNA, RNA and proteins, as a computational or control tool. Traditionally, DNA computers were thought to compete with electronic computers to solve, for example, NP-complete problems. However recently, there has been a focus shift to biomedical applications. One form of DNA computing is per...
متن کاملSimulations of Microreactors: The Order of Things
Simulations are needed to predict various parameters for chemical reactions and error propagation in microfluidic networks. This paper studies the impact of the order of microreactors implementing a fluidic network on the error in solutions for Boolean expressions. Additionally, we present a computer program that augments the software toolkit introduced in our previous work. The program is usef...
متن کاملLigation module for in-vitro selection in DNA computing
In this paper a classical AI problem is proposed to be solved by DNA computing: theorem proving. Since the complexity grows exponentially with the size of the problem, the solving process should be done in parallel. Massive parallelism is one of the advantages of DNA computers. It will be shown that the resolution refutation proof can be readily implemented by DNA hybridisation and ligation. Mi...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملFault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001